Reinforcement Learning for Practical Express Systems with Mixed Deliveries and Pickups

نویسندگان

چکیده

In real-world express systems, couriers need to satisfy not only the delivery demands but also pick-up of customers. Delivery and pickup tasks are usually mixed together within integrated routing plans. Such a problem can be abstracted formulated as Vehicle Routing Problem with Mixed Pickup (VRPMDP), which is an NP-hard combinatorial optimization problem. To solve VRPMDP, there three major challenges below. (a) Even though successive independent accomplish, inter-influence between choosing task or deal still exists. (b) Due two-way flow goods depot customers, loading rate vehicles leaving affects decisions. (c) The proportion deliveries pickups will change due complex demand situation in scenarios, requires robustness algorithm. above, we design encoder-decoder based framework generate high-quality robust VRPMDP solutions. First, consider instance graph utilize GNN encoder extract feature effectively. detailed solutions further decoded sequence by decoder attention mechanism. Second, propose Coordinated Decision Loading (CDLR) mechanism determine dynamically after vehicle returns depot, thus avoiding influence improper settings. Finally, model equipped CDLR simultaneously adapt changes pickups. We conduct experiments demonstrate effectiveness our model. show that method achieves desirable results generalization ability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Vehicle Routing Problem with Divisible Deliveries and Pickups

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Nagy, Gábor and Wassan, Niaz A. and Speranza, M. Grazia and Archetti, Claudia (2015) The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science . pp. 271-294. ISSN 0041-...

متن کامل

Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

T paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense ...

متن کامل

Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

The Vehicle Routing Problem with Pickups and Deliveries (VRPPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods. We do not make the assumption common in the VRPPD literature, that goods may only be picked up after all deliveries have been completed. We also eschew the concept of insertion and propose a method that treats pickups an...

متن کامل

Approximation Algorithms for the Capacitated Traveling Salesman Problem with Pickups and Deliveries

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited capacity is available to perform this task. The problem is to determine the tour the vehicle sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Knowledge Discovery From Data

سال: 2023

ISSN: ['1556-472X', '1556-4681']

DOI: https://doi.org/10.1145/3546952